An Improved ACO Algorithm for Multicast Routing
نویسندگان
چکیده
The multicast routing problem with quality of service (QoS) constraints is a key requirement of computer networks supporting multimedia applications. In order to resolve Qos multicast routing effectively and efficiently, an improved ant colony optimization (ACO) algorithm is proposed to resolve this problem.The core idea of improved ACO algorithm is mainly realized through pheromone local and global updating rule.Experimental results show that this algorithm can find optimal solution quickly and has a good scalability.
منابع مشابه
Multicast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملInterference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملApplication of An improved Ant Colony Optimization on Multicast Routing Problem
Three improvements on ant colony optimization (ACO) are presented in this paper. The improvements are given as follows : A novel optimized implementing approach is designed to reduce the processing costs involved with routing of ants in the conventional ACO. Based on the model of network routing, the set of candidates is limited to the nearest c points in order to reduce the counting of other p...
متن کاملThe Multicast Routing QoS Based on the Improved ACO Algorithm
For the search of the optimal path and the establishment of the multicast tree which meets QoS constraints in multicast routing, an improved ant colony algorithm is proposed in the paper. In the searching process, two group ants carry out searching separately and alternate information after one search. After a period of time, the rotary table is adapted to choosing a path and avoids stagnation,...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کامل